Fixpoint operators for domain equations
نویسندگان
چکیده
We investigate /xpoint operators for domain equations. It is routine to verify that if every endofunctor on a category has an initial algebra, then one can construct a /xpoint operator from the category of endofunctors to the category. That construction does not lift routinely to enriched categories, using the usual enriched notion of initiality of an endofunctor. We show that by embedding the 2-category of small enriched categories into the 2-category of internal categories of a presheaf topos, we can recover the /xpoint construction elegantly. Also, we show that in the presence of cotensors, an enriched category allows the /xpoint construction. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
On Solving Nominal Fixpoint Equations
In nominal syntax, variable binding is specified using atomabstraction constructors, and alpha-equivalence is formalised using fresh-ion constructors, and alpha-equivalence is formalised using freshness constraints and atom swappings, which implement variable renamings. Composition of swappings gives rise to atom permutations. Algorithms to check equivalence, match and unify nominal terms have ...
متن کاملStatic Analysis by Policy Iteration on Relational Domains
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and templates used for static analysis of programs by abstract interpretation. This paper extends previous work on the non-relational domain of intervals to relational domains. The algorithm is based on policy iteration techn...
متن کاملGames for Topological Fixpoint Logic
Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators are interpreted via clopen sets. We develop a game-theoretic semantics for this logic. First we i...
متن کاملSolving Recursive Net Equations
This paper describes a denotational approach to the Petri net semantics of recursive expressions. A domain of nets is identified such that the solution of a given recursive equation can be found by fixpoint approximation from some suitable starting point. In turn, a suitable starting point can be found by fixpoint approximation on a derived domain of sets of trees. The paper explains the theory...
متن کاملStrong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation. The constraint-propagation step is a fixpoint algorithm that applies pruning operators to tighten the release and due dates of activities using precedence or resource constraints. A variety of pruning operators for re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 278 شماره
صفحات -
تاریخ انتشار 2002